Semantical Considerations on Floyd-Hoare Logic
نویسنده
چکیده
منابع مشابه
Program Algebras with Monotone Floyd-Hoare Composition
In the paper special program algebras of partial predicates and functions are described. Such algebras form a semantic component of a modified Floyd-Hoare logic constructed on the base of a composition-nominative approach. According to this approach, Floyd-Hoare assertions are presented with the help of a special composition called Floyd-Hoare composition. Monotonicity and continuity of this co...
متن کاملDeriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
We derive a Floyd-Hoare logic for non-local jumps and mutable higher-order procedural variables from a formulæ-as-types notion of control for classical logic. A key contribution of this work is the design of an imperative dependent type system for Hoare triples, which corresponds to classical logic, but where the famous consequence rule is admissible. Moreover, we prove that this system is comp...
متن کاملAn Elementary Proof for Some Semantic Characterizations of Nondeterministic Floyd-Hoare Logic
We give a relatively simple and direct proof for Csirmaz's characterization of Floyd-Hoare logic for nondeterministic programs [5]. (This also yields a very simple proof for Leivant's characterization [13].) We also establish a direct connection between "relational traces" and "time-models" for nondeterministic programs. Introduction In this paper we investigate semantic characterizations of th...
متن کاملWeak Second Order Characterizations of Various Program Verification Systems
We show the equivalence (!{ LeivIIlII' .1' dUlfl/r;wr;zmion of Floyd-Hoare Logic in weak second order logic (fLeSSJ) with both Csirltl(lZ'S (f Cs80I) 111/(/ Selin's (f Sa85bJ) characterizations of Floyd-Hoare logic in Nonstandard Logics of Programs, Ow method allows us u) spell out tlJ.e precise role of the comprehension axiom in weak second order [og;I:. Ii .(~ then prove similar resultsIor ot...
متن کاملDeriving a Hoare-Floyd logic for non-local jumps from a formulae-as-types notion of control
We derive a Hoare-Floyd logic for non-local jumps and mutable higher-order procedural variables from a formulæ-as-types notion of control for classical logic. The main contribution of this work is the design of an imperative dependent type system for non-local jumps which corresponds to classical logic but where the famous consequence rule is still derivable. Hoare-Floyd logics for non-local ju...
متن کامل